On the Axiomatizability of Priority

On the axiomatizability of priority II

This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finit...

Axiomatizability by a Scheme

In this paper we give an improvement of Vaught’s Theorem on Axiomatizability by a Scheme. We show that any RE theory that directly interprets the theory of non-surjective unordered pairing, where pairing need not be functional, is axiomatizable by a scheme.

Some Supervaluation-based Consequence Relations

In this paper, we define some consequence relations based on supervaluation semantics for partial models, and we investigate their properties. For our main consequence relation, we show that natural versions of the following fail: upwards and downwards Lowenheim–Skolem, axiomatizability, and compactness. We also consider an alternate version for supervaluation semantics, and show both axiomatiz...

Axiomatizability of Reducts of Algebras of Relations

On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces

We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist...